The phenomenon of inverse linking, where a noun phrase embedded within another behaves with respect to binding as though it were structurally independent, has proven challenging for theories of the syntax–semantics interface. In this paper I show that, using an LF-movement style approach to the syntax–semantics interface, we can derive all and only the appropriate meanings for such constructions using no semantic operations other than function application and composition. The solution relies neither on a proliferation of lexical ambiguity nor on (...) abandoning the idea that pronouns denote variables, but rather on a straightforward (and standard) reification of assignment functions, which allows us to define abstraction operators within our models. (shrink)

Cooper storage is a widespread technique for associating sentences with their meanings, used in diverse linguistic and computational linguistic traditions. This paper encodes the data structures and operations of cooper storage in the simply typed linear \-calculus, revealing the rich categorical structure of a graded applicative functor. In the case of finite cooper storage, which corresponds to ideas in current transformational approaches to syntax, the semantic interpretation function can be given as a linear homomorphism acting on a regular set of (...) trees, and thus generation can be done in polynomial time. (shrink)